Resolution Refutations and Propositional Proofs with Height-Restrictions
نویسنده
چکیده
Height restricted resolution (proofs or refutations) is a natural restriction of resolution where the height of the corresponding proof tree is bounded. Height restricted resolution does not distinguish between treeand sequence-like proofs. We show that polylogarithmic-height resolution is strongly connected to the bounded arithmetic theory S 2(α). We separate polylogarithmic-height resolution from quasi-polynomial size tree-like resolution. Inspired by this we will study infinitely many sub-linear-height restrictions given by functions n 7→ 2i “
منابع مشابه
Compressing Propositional Refutations
We report initial results on shortening propositional resolution refutation proofs. This has an application in speeding up deductive reconstruction (in theorem provers) of large propositional refutations, such as those produced by SAT-solvers.
متن کاملOn Propositional QBF Expansions and Q-Resolution
Over the years, proof systems for propositional satisfiability (SAT) have been extensively studied. Recently, proof systems for quantified Boolean formulas (QBFs) have also been gaining attention. Q-resolution is a calculus enabling producing proofs from DPLL-based QBF solvers. While DPLL has become a dominating technique for SAT, QBF has been tackled by other complementary and competitive appr...
متن کاملOn the Complexity of Propositional Proof Systems
In the thesis we have investigated the complexity of proofs in several propositional proof systems. Our main motivation has been to contribute to the line of research started by Cook and Reckhow to obtain how much knowledge as possible about the complexity of di erent proof systems to show that there is no super proof system. We also have been motivated by more applied questions concerning the ...
متن کاملMikoláš Janota
Over the years, proof systems for propositional satisfiability (SAT) have been extensively studied. Recently, proof systems for quantified Boolean formulas (QBFs) have also been gaining attention. Q-resolution is a calculus enabling producing proofs from DPLL-based QBF solvers. While DPLL has become a dominating technique for SAT, QBF has been tackled by other complementary and competitive appr...
متن کاملAverage-Case Separation in Proof Complexity: Short Propositional Refutations for Random 3CNF Formulas
Separating different propositional proof systems—that is, demonstrating that one proof system cannot efficiently simulate another proof system—is one of the main goals of proof complexity. Nevertheless, all known separation results between non-abstract proof systems are for specific families of hard tautologies: for what we know, in the average case all (non-abstract) propositional proof system...
متن کامل